A parameterized proximal point algorithm for separable convex optimization
نویسندگان
چکیده
In this paper, we develop a parameterized proximal point algorithm (PPPA) for solving a class of separable convex programming problems subject to linear and convex constraints. The proposed algorithm is provable to be globally convergent with a worst-case O(1/t) convergence rate, where t denotes the iteration number. By properly choosing the algorithm parameters, numerical experiments on solving a sparse optimization problem arising from statistical learning show that our P-PPA could perform significantly better than other state-of-the-art methods, such as the alternating direction method of multipliers and the relaxed proximal point algorithm.
منابع مشابه
A novel parameterized proximal point algorithm with applications in statistical learning
In the literature, there are a few researches for the proximal point algorithm (PPA) with some parameters designed in the metric proximal matrix, especially for the multi-objective optimization problems. Introducing some parameters to the PPA can make it more attractive and flexible. By using the unified framework of the classical PPA and constructing a parameterized proximal matrix, in this pa...
متن کاملA Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملConvergence rate of a proximal multiplier algorithm for separable convex minimization
This paper analyze the convergence rate of a proximal algorithm called Proximal Multiplier Algorithm with Proximal Distances (PMAPD), proposed by us in [20], to solve convex minimization problems with separable structure. We prove that, under mild assumptions, its primal-dual sequences converge linearly to the optimal solution for a class of proximal distances .
متن کاملA relaxed customized proximal point algorithm for separable convex programming
The alternating direction method (ADM) is classical for solving a linearly constrained separable convex programming problem (primal problem), and it is well known that ADM is essentially the application of a concrete form of the proximal point algorithm (PPA) (more precisely, the Douglas-Rachford splitting method) to the corresponding dual problem. This paper shows that an efficient method comp...
متن کاملW-convergence of the proximal point algorithm in complete CAT(0) metric spaces
In this paper, we generalize the proximal point algorithm to complete CAT(0) spaces and show that the sequence generated by the proximal point algorithm $w$-converges to a zero of the maximal monotone operator. Also, we prove that if $f: Xrightarrow ]-infty, +infty]$ is a proper, convex and lower semicontinuous function on the complete CAT(0) space $X$, then the proximal...
متن کامل